Eigenvalue problems of Nordhaus–Gaddum type

Eigenvalue problems of Nordhaus-Gaddum type

Let G be a graph with n vertices and m edges and let μ1 (G) ≥ ... ≥ μn (G) be the eigenvalues of its adjacency matrix. We discuss the following general problem. For k fixed and n large, find or estimate fk (n) = max v(G)=n |μk (G)|+ ∣

Quasilinear Elliptic Systems of Resonant Type and Nonlinear Eigenvalue Problems

Derivation of Eigenvalue Problems

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

EIGENVALUE PROBLEMS FOR p(x)-KIRCHHOFF TYPE EQUATIONS

In this article, we study the nonlocal p(x)-Laplacian problem